Hypercube based Divisibility Management for Integrated Credit Dispense and Computing Resource Allocation

E-cash algorithms offer strong protection on principal anonymity, transaction authenticity and quota enforcement of credit dispense but as of now there is no study on how to integrate them with the resource allocation schemes. In this paper, we propose a hypercube based tracking system for both credit dispense and resource allocation of computing assets using E-cash algorithms. Hypercube is chosen as the common references of the two major functions, so that the study results can be tailored for a wide range of data structures that could be used for both purposes. Based on the N-divisibility framework of disposable authentication, we develop the analysis techniques to assess the security properties using hypercube to track credit spending and for subcube allocation for two different schemes. The first scheme is highly secure yet has high computing costs. On the other hand, the second scheme can achieve the same security goals at much lower computing costs by relaxing anonymity protection rules but adding a simple anonymity hazard checking routine before a subcube can be spent/allocated. Anonymity hazard refers to the condition that the unique secret (commonly called the identity) assigned to a token can be deciphered from messages generated from transactions even when no double spending occurs. Simulations results show that well known subcube allocation schemes binary code and binary gray code are free of anonymity hazards because of their restrictive allocation rules. Anonymity hazards can occur to an unrestricted subcube allocation scheme if the anonymity hazard checking routine is not devised. Our study suggests that by decoupling of credit management and resource management, highly secure and efficient computing resource management schemes can be developed based on one integrated framework. Index Terms — Disposable Authentication, E-cash, Hypercube, N-divisible Token, Resource Allocation